A low latency SISO with application to broadband turbo decoding
نویسندگان
چکیده
The standard algorithm for computing the soft-inverse of a finite-state machine [i.e., the soft-in/soft-out (SISO) module] is the forward–backward algorithm. These forward and backward recursions can be computed in parallel, yielding an architecture with latency ( ), where is the block size. We demonstrate that the standard SISO computation may be formulated using a combination of prefix and suffix operations. Based on well-known tree-structures for fast parallel prefix computations in the very large scale integration (VLSI) literature (e.g., tree adders), we propose a tree-structured SISO that has latency (log 2 ). The decrease in latency comes primarily at a cost of area with, in some cases, only a marginal increase in computation. We discuss how this structure could be used to design a very high throughput turbo decoder or, more generally, an iterative detector. Various subwindowing and tiling schemes are also considered to further improve latency.
منابع مشابه
AN O(log2 N)-LATENCY SISO WITH APPLICATION TO BROADBAND TURBO DECODING
The standard algorithm for computing the softinverse of a finite-state machine (i.e., the Soft-in/Softout or SISO) module, is the forward-backward algorithm. These forward and backward recursions can be computed in parallel, yielding an architecture with latency O(N), where N is the block size. We demonstrate that the standard SISO computation may be formulated using a combination of a prefix a...
متن کاملDesign and VLSI Implementation of a High Throughput Turbo Decoder
Turbo codes are one of the most efficient error correcting code which approaches the Shannon limit. However the major drawback of turbo codes is its high latency due to its iterative decoding process. The high throughput in turbo decoder can be achieved by parallelizing several Soft Input Soft Output(SISO) units together. In this way, multiple SISO decoders work
متن کاملParallel VLSI architecture for MAP turbo decoder
Turbo codes achieve performance near the Shannon limit. Standard sequential VLSI implementation of turbo decoding requires many iterations and incurs a long latency, which cannot be tolerated in some applications. A novel parallel VLSI architecture for turbo decoding is described, comprising multiple SISO elements, operating jointly on one turbo coded block, and a new parallel interleaver. Late...
متن کاملParallel VLSI Architecture and Parallel Interleaver Design for MAP Turbo Decoder
Abstract Standard VLSI implementation of turbo decoding requires substantial memory and incurs a long latency, which cannot be tolerated in some applications. A novel parallel VLSI architecture for low-latency turbo decoding is described, comprising multiple SISO elements, operating jointly on one turbo coded block, and a new parallel interleaver. The design algorithm for the parallel interleav...
متن کاملA Flexible LDPC/Turbo Decoder Architecture
Low-density parity-check (LDPC) codes and convolutional Turbo codes are two of the most powerful error correcting codes that are widely used in modern communication systems. In a multi-mode baseband receiver, both LDPC and Turbo decoders may be required. However, the different decoding approaches for LDPC and Turbo codes usually lead to different hardware architectures. In this paper we propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Journal on Selected Areas in Communications
دوره 19 شماره
صفحات -
تاریخ انتشار 2001